Self-Stabilizing Processes Based on Random Signs

Self-stabilizing processes in multi-wells landscape in R - Convergence∗

Self-stabilizing processes are non-markovian diffusions. The own law of the process intervenes in the drift. When the non-interacting part of the drift corresponds to the gradient of a convex potential, it has been proved in some different ways that such processes converge when the time goes to infinity. However, in a previous paper, it has been proved that there is non-uniqueness of the statio...

On Self-stabilizing Systems " By

Observations on Self - Stabilizing Graph

We investigate the existence of deterministic uniform self-stabilizing algorithms (DUSSAs) for a number or problems on connected undirected graphs. This investigation is carried out under three models of parallelism, namely central daemon, restricted parallelism, and maximal paral-lelism. We observe that for several problems including 2-coloring odd-degree complete bipartite graphs, 2-coloring ...

Robust self-stabilizing weight-based clustering algorithm

Ad hoc networks consist of wireless hosts that communicate with each other in the absence of a fixed infrastructure. Such networks cannot rely on centralized and organized network management. The clustering problem consists of partitioning network nodes into non-overlapping groups called clusters. Clusters give a hierarchical organization to the network that facilitates the network management a...

Token-Based Self-Stabilizing Uniform Algorithms